Scale-free networks emerging from weighted random graphs
نویسندگان
چکیده
منابع مشابه
Scale-free networks emerging from weighted random graphs.
We study Erdös-Rényi random graphs with random weights associated with each link. We generate a "supernode network" by merging all nodes connected by links having weights below the percolation threshold (percolation clusters) into a single node. We show that this network is scale-free, i.e., the degree distribution is P(k) approximately k(-lambda) with lambda=2.5. Our results imply that the min...
متن کاملMuller's ratchet in random graphs and scale-free networks.
Muller's ratchet is an evolutionary process that has been implicated in the extinction of asexual species, the evolution of mitochondria, the degeneration of the Y chromosome, the evolution of sex and recombination and the evolution of microbes. Here we study the speed of Muller's ratchet in a population subdivided into many small subpopulations connected by migration, and distributed on a netw...
متن کاملWeighted Scale-Free Random Graph Model
Systems as diverse as genetic networks or the World Wide Web are best described as networks with complex topology. A common property of many large networks is that the vertex connectivities follow a scale-free power-law distribution. This feature was found to be a consequence of three generic mechanisms: (i) networks expand continuously by attaching addition of new vertices, (ii) new vertex wit...
متن کاملScale-free random graphs and Potts model
We introduce a simple algorithm that constructs scale-free random graphs efficiently: each vertex i has a prescribed weight Pi ∝ i−μ (0 < μ < 1) and an edge can connect vertices i and j with rate PiPj . Corresponding equilibrium ensemble is identified and the problem is solved by the q → 1 limit of the q-state Potts model with inhomogeneous interactions for all pairs of spins. The number of loo...
متن کاملCoupling Scale-Free and Classical Random Graphs
Recently many new “scale-free” random graph models have been introduced, motivated by the power-law degree sequences observed in many large-scale real-world networks. The most studied of these is the Barabási-Albert growth with “preferential attachment” model, made precise as the LCD model by the present authors. Here we use coupling techniques to show that in certain ways the LCD model is not ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2006
ISSN: 1539-3755,1550-2376
DOI: 10.1103/physreve.73.025103